774C - Maximum Number - CodeForces Solution


*special problem constructive algorithms greedy implementation *1200

Please click on ads to support us..

C++ Code:

#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define fi first
#define se second
#define mp make_pair
using namespace std;

int n;

int main(){
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  cin >> n;
  if(n % 2 == 1){
    cout << 7;
    n -= 3;
  } //bebek
  for(int i = n; i > 0; i -= 2){
    cout << 1;
  } cout << '\n';
}


Comments

Submit
0 Comments
More Questions

1237A - Balanced Rating Changes
1616A - Integer Diversity
1627B - Not Sitting
1663C - Pōja Verdon
1497A - Meximization
1633B - Minority
688B - Lovely Palindromes
66B - Petya and Countryside
1557B - Moamen and k-subarrays
540A - Combination Lock
1553C - Penalty
1474E - What Is It
1335B - Construct the String
1004B - Sonya and Exhibition
1397A - Juggling Letters
985C - Liebig's Barrels
115A - Party
746B - Decoding
1424G - Years
1663A - Who Tested
1073B - Vasya and Books
195B - After Training
455A - Boredom
1099A - Snowball
1651D - Nearest Excluded Points
599A - Patrick and Shopping
237A - Free Cash
1615B - And It's Non-Zero
1619E - MEX and Increments
34B - Sale